graph partitioning problem造句
例句與造句
- We see that ( a ) is a better balanced partition, thus motivating the importance of modularity in graph partitioning problems.
- Although many other related graph partitioning problems are NP-complete, even for planar graphs, it is possible to find a minimum-width branch-decomposition of a planar graph in polynomial time.
- It's difficult to find graph partitioning problem in a sentence. 用graph partitioning problem造句挺難的